The Hyper-Zagreb Index of Graph Operations

Authors

  • A. SAYADI University of Tehran, Iran
  • G. SHIRDEL University of Qom, Iran
  • H. REZAPOUR University of Qom, Iran
Abstract:

Let G be a simple connected graph. The first and second Zagreb indices have been introduced as  vV(G) (v)2 M1(G) degG and M2(G)  uvE(G)degG(u)degG(v) , respectively, where degG v(degG u) is the degree of vertex v (u) . In this paper, we define a new distance-based named HyperZagreb as e uv E(G) . (v))2 HM(G)     (degG(u)  degG In this paper, the HyperZagreb index of the Cartesian product, composition, join and disjunction of graphs are computed.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

A note on hyper-Zagreb index of graph operations

In this paper, the Hyper - Zagreb index of the Cartesian product, composition and corona product of graphs are computed. These corrects some errors in G. H. Shirdel et al.[11].

full text

the hyper-zagreb index of graph operations

let g be a simple connected graph. the first and second zagreb indices have been introducedas  vv(g)(v)2 m1(g) degg and m2(g)  uve(g)degg(u)degg(v) , respectively,where degg v(degg u) is the degree of vertex v (u) . in this paper, we define a newdistance-based named hyperzagreb as e uv e(g) .(v))2 hm(g)     (degg(u)  degg inthis paper, the hyperzagreb index of the cartesian product...

full text

a note on hyper-zagreb index of graph operations

in this paper, the hyper - zagreb index of the cartesian product, composition and corona product of graphs are computed. these corrects some errors in g. h. shirdel et al.[11].

full text

The Hyper-Zagreb Index of Four Operations on Graphs

The hyper-Zagreb index of a connected graph G, denoted by HM(G), is defined as HM(G) = ∑ uv∈E(G) [dG(u) + dG(v)] where dG(z) is the degree of a vertex z in G. In this paper, we study the hyper-Zagreb index of four operations on graphs.

full text

The hyper-Wiener index of graph operations

Let G be a graph. The distance d(u,v) between the vertices u and v of the graph G is equal to the length of a shortest path that connects u and v. The Wiener index W(G) is the sum of all distances between vertices of G, whereas the hyper-Wiener index WW(G) is defined as WW(G)=12W(G)+12@?"{"u","v"}"@?"V"("G")d (u,v)^2. In this paper the hyper-Wiener indices of the Cartesian product, composition,...

full text

Reformulated First Zagreb Index of Some Graph Operations

The reformulated Zagreb indices of a graph are obtained from the classical Zagreb indices by replacing vertex degrees with edge degrees, where the degree of an edge is taken as the sum of degrees of the end vertices of the edge minus 2. In this paper, we study the behavior of the reformulated first Zagreb index and apply our results to different chemically interesting molecular graphs and nano-...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 4  issue 2

pages  213- 220

publication date 2013-05-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023